@article{graham1979oaa,
  title={{Optimization and approximation in deterministic sequencing and scheduling: a survey}},
  author={Graham, R.L. and Lawler, E.L. and Lenstra, J.K. and Kan, A.H.G.R.},
  journal={Annals of Discrete Mathematics},
  volume={5},
  number={2},
  pages={287--326},
  year={1979}
}

@article{lee1996msa,
  title={{Machine scheduling with an availability constraint}},
  author={Lee, C.Y.},
  journal={Journal of Global Optimization},
  volume={9},
  number={3},
  pages={395--416},
  year={1996},
  publisher={Springer}
}

@article{baptiste1999pta,
  title={{Polynomial Time Algorithms for Minimizaing the Weighted Number of Late Jobs on A Single Machine with Equal Processing Times}},
  author={Batiste, P.},
  journal={J. Sched},
  volume={2},
  number={245},
  pages={252},
  year={1999}
}

@article{du1992mnl,
  title={{Minimizing the number of late jobs with release time constraints}},
  author={Du, J. and Leung, J.Y.T. and Wong, C.S.},
  journal={Journal of Combinatorial Mathematics and Combinatorial Computing},
  volume={11},
  pages={97--107},
  year={1992}
}

@article{lawler1990dpa,
  title={{A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs}},
  author={Lawler, E.L.},
  journal={Annals of Operations Research},
  volume={26},
  number={1},
  pages={125--133},
  year={1990},
  publisher={Springer}
}

@article{lenstra1977cms,
  title={{Complexity of machine scheduling problems}},
  author={Lenstra, JK and Kan, A.H.G.R. and Brucker, P.},
  journal={Studies in Integer Programming},
  volume={1},
  pages={343--362},
  year={1977},
  publisher={New York, NY, USA: North-Holland Publishing Company}
}

@article{kise1978sco,
  title={{A solvable case of the one-machine scheduling problem with ready and due times}},
  author={Kise, H. and Ibaraki, T. and Mine, H.},
  journal={Operations Research},
  volume={26},
  number={1},
  pages={121--126},
  year={1978}
}

@article{baptiste2002fne,
  title={{Fourteen notes on equal-processing-time scheduling}},
  author={Baptiste, P. and Brucker, P. and Knust, S. and Timkovsky, V.G.},
  journal={OSM Reihe P},
  year={2002}
}

@article{brucker1999pcm,
  title={{Preemption can make parallel machine scheduling problems hard}},
  author={Brucker, P. and Kravchenko, S.A.},
  journal={Osnabrucker Schriften zur Mathematik, Reihe P},
  year={1999}
}

@book{brucker2004sa,
  title={{Scheduling Algorithms}},
  author={Brucker, P.},
  year={2004},
  publisher={Springer}
}

@article{dawande2000aam,
  title={{Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions}},
  author={Dawande, M. and Kalagnanam, J. and Keskinocak, P. and Salman, FS and Ravi, R.},
  journal={Journal of Combinatorial Optimization},
  volume={4},
  number={2},
  pages={171--186},
  year={2000},
  publisher={Springer}
}

@article{rothkopf1966sit,
  title={{Scheduling Independent Tasks on Parallel Processors}},
  author={Rothkopf, M.H.},
  journal={Management Science},
  volume={12},
  number={5},
  pages={437--447},
  year={1966},
  publisher={JSTOR}
}

@article{lawler1969fea,
  title={{A functional equation and its application to resource allocation and sequencing problems}},
  author={Lawler, E.L. and Moore, JM},
  journal={Management Science},
  volume={16},
  number={1},
  pages={77--84},
  year={1969},
  publisher={JSTOR}
}

@article{karp1972rac,
  title={{Reducibility among combinatorial problems}},
  author={Karp, R.M.},
  journal={Complexity of Computer Computations},
  volume={43},
  pages={85--103},
  year={1972}
}

@article{vandenakker1999pms,
  title={{Parallel Machine Scheduling by Column Generation}},
  author={van den Akker, JM and Hoogeveen, JA and van de Velde, SL},
  journal={Operations Research},
  volume={47},
  number={6},
  pages={862--872},
  year={1999},
  publisher={JSTOR}
}

@article{chen1999spm,
  title={{Solving Parallel Machine Scheduling Problems by Column Generation}},
  author={Chen, Z.L. and Powell, W.B.},
  journal={INFORMS JOURNAL ON COMPUTING},
  volume={11},
  pages={78--94},
  year={1999}
}



